Pattern classification by convex analysis
نویسنده
چکیده
A useful discriminant vector for pattern classification is one that maximizes the minimum separation of discriminant function values for two pattern classes. This optimality criterion can prove valuable in many situations because it emphasizes the class elements that are most difficult to classify. A method for computing this discriminant vector by quadratic programming is derived. The resulting calculation scales with training set size rather than number of input variables and hence is well suited to the high dimensionality of image classification tasks. Digitized images are used to demonstrate application of the approach to two-class and multipleclass image classification tasks.
منابع مشابه
Plants Images Classification Based on Textural Features using Combined Classifier
Image classification plays an important role in many applicable fields in our life, such as image analysis, remote sensing, and pattern recognition [9]. It can be defined as the process of sorting all the pixels in an image into a finite number of individual classes[5]. There are many types of techniques which can be used to classify and recognize different types of objects in images. For conve...
متن کاملMandibular Trabecular Bone Analysis Using Local Binary Pattern for Osteoporosis Diagnosis
Background: Osteoporosis is a systemic skeletal disease characterized by low bone mineral density (BMD) and micro-architectural deterioration of bone tissue, leading to bone fragility and increased fracture risk. Since Panoramic image is a feasible and relatively routine imaging technique in dentistry; it could provide an opportunistic chance for screening osteoporosis. In this regard, numerous...
متن کاملOptimal convex error estimators for classification
A cross-validation error estimator is obtained by repeatedly leaving out some data points, deriving classifiers on the remaining points, computing errors for these classifiers on the left-out points, and then averaging these errors. The 0.632 bootstrap estimator is obtained by averaging the errors of classifiers designed from points drawn with replacement and then taking a convex combination of...
متن کاملFace Recognition by Cognitive Discriminant Features
Face recognition is still an active pattern analysis topic. Faces have already been treated as objects or textures, but human face recognition system takes a different approach in face recognition. People refer to faces by their most discriminant features. People usually describe faces in sentences like ``She's snub-nosed'' or ``he's got long nose'' or ``he's got round eyes'' and so like. These...
متن کاملClipping algorithms for solving the nearest point problem over reduced convex hulls
The nearest point problem (NPP), i.e., finding the closest points between two disjoint convex hulls, has two classical solutions, the Gilbert–Schlesinger–Kozinec (GSK) and Mitchell–Dem’yanov–Malozemov (MDM) algorithms. When the convex hulls do intersect, NPP has to be stated in terms of reduced convex hulls (RCHs), made up of convex pattern combinations whose coefficients are bound by a mo1 val...
متن کامل